منابع مشابه
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cycle of the given graph and a set of its edges to be embedded inside this cycle and a set of its edges to be embedded outside this cycle. Their practical importance in graph visualization applications is due to the capa...
متن کاملTopological Morphing of Planar Graphs
In this paper we study how two planar embeddings of the same biconnected graph can be morphed one into the other while minimizing the number of elementary changes. We define two operations to modify the combinatorial embedding and the external face of a biconnected graph. First, we show that given two embeddings of the graph, the problem of computing the minimum number of operations that morph ...
متن کاملA provably good multilayer topological planar routing algorithm in IC layout designs
Given a number of routing layers, the multilayer topological planar routing problem is to choose a maximum (weighted) set of nets so that each net in the set can be topologically routed entirely in one of the given layers without crossing other nets. This problem has important application in the layout design of multilayer IC technology, which has become available recently. In this paper, we pr...
متن کاملPlanar Topological Routing - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
We develop a simple linear time algorithm to determine if a collection of two-pin nets can be routed, topologically, in a plane (i.e., single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarng. Topological routability testing of a collection of multipin nets is shown to be equivalent to planarity testing, and a simple linear tim...
متن کاملPlanar Interchangeable 2-terminal Routing
abstract Many practical routing problems such as BGA, PGA and test xture routing involve routing two-terminal nets on a plane with exchangeable pins. In this paper, we unify these diierent problems as instances of the Planar Interchangeable 2-Terminal Routing (PI2TR) problem. We formulate the problem as ows in a routing network. Secondly, we show that PI2TR is NP-complete by reduction from sati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1997
ISSN: 0278-0070
DOI: 10.1109/43.640623